A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Anuratha, V.
- An Efficient Topology Construction for Wireless Mesh Networks with Reduced Cost, Energy and Interference
Authors
1 PG. Comp. Science, Sree Saraswathi Thyagaraja College, Pollachi, Tamil Nadu, IN
2 Sri Vasavi College of Arts & Science, Erode, Tamil Nadu, IN
Source
Networking and Communication Engineering, Vol 3, No 2 (2011), Pagination: 105-110Abstract
Wireless Mesh Networks (WMNs) is evolving major technology for the future generation wireless networking. Wireless mesh networks currently having faster improvement and used in several helpful applications because of its merits than the other wireless networks. Wireless mesh networks includes features such as self-organization, self-configuration, and reliable when some failure occurs, and robust against RF interference, obstacles or power outage. This is mainly because these networks are built on advanced physical technologies. However, the topology constructions in WMNs are very important for proper functioning of network will better output. This leads to several researches for the construction of topology. The cost for the construction of WMN is an important factor because of its high cost. The cost mainly depends on the height of the tower. So the height should be determined accordingly. But at the same time, the energy should be conserved. This paper provides better techniques for construction of tower with reduced cost and at the same time this paper also focuses on the technique for energy conservation. This paper also focuses on the self-organization algorithm. The main intention of the self-organization method is to decrease the interference and enhance the aggregate capacity of the network. This can be achievable by dealing the two major factors that are related with the self organization of WMN – Scalability and Stability. The experimental results shows the better result obtained by using the proposed technique.Keywords
Topology Construction (TC), Wireless Mesh Network, Self Organization.
- A Proactive Secret Sharing Scheme in Matrix Projection Using Visual Cryptography
Authors
1 Sree Saraswathi Thyagaraja College, Pollachi – 642 107, Coimbatore, Tamil Nadu, IN
Source
Digital Image Processing, Vol 6, No 7 (2014), Pagination: 320-323Abstract
Biometrics deal with automated methods of identifying a person or verifying the identity of a person based on physiological or behavioral characteristics. Visual cryptography is a secret sharing scheme where a secret image is encrypted into the shares which independently disclose no information about the original secret image. Thus, visual cryptography provides great means for helping such security needs as well as extra layer of authentication. Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. In this research integrated Proactive Bai’s Secret Sharing Scheme using matrix projection. This paper presents a distributed PSS method for the matrix projection SSS. Once the new shares are updated, adversaries cannot discover the secrets from k shares which are mixed with past and present shares.
Keywords
Biometrics, Visual Cryptography, Shamir’s Secret Sharing (SSS) Scheme, Proactive Bai’s Secret Sharing Scheme and Matrix Projection.- A Comparative Study of Various Clustering Algorithms in Data Mining
Authors
1 Department of Computer Science, Sree Saraswathi Thyagaraja College, Thippampatti, IN
Source
Fuzzy Systems, Vol 6, No 3 (2014), Pagination: 84-88Abstract
The goal of this survey is to provide a comprehensive review of different clustering techniques in data mining.- A General K-Mean Clustering Algorithm Based on Constrained Dynamic Time Warping Distance Measure
Authors
1 Department of Computer Science, Sree Saraswathi Thyagaraja College, Thippampatti, Pollachi, IN
Source
Biometrics and Bioinformatics, Vol 6, No 7 (2014), Pagination: 179-181Abstract
Clustering is a division of data into groups of similar objects. Each group, called cluster, consists of objects that are similar between themselves and dissimilar to objects of other groups. In high dimensional data space, clusters are likely to exist in different subspaces. General K-Mean (GKM) is a classic clustering algorithm, but it cannot be used to find subspace clusters. In this work, Dynamic Time Warping (DTW) is a much more dynamic distance measure for time series, allowing comparable shapes to competition even this work is out of phase in the time association. It permits a non-linear illustration of single suggestion to a different by reducing the space among the two. A decade back, DTW was establishing into Data Mining neighborhood as effectiveness for different responsibilities for moments sequence evils including categorization, group, and variance discovery. Experimental results make obvious that the DTW advances create better performance than GKM clustering algorithms.
Keywords
Cluster, K-Mean, General K-Mean, Dynamic Time Warping (DTW), Distance Measure.- An Efficient T-Score Ranking for Microarray Gene Selection
Authors
1 Sree Saraswathi Thyagaraja College, Pollachi – 642 107, Coimbatore, Tamil Nadu, IN
2 Sree Saraswathi Thyagaraja College, Pollachi - 642 107, Coimbatore, Tamil Nadu, IN
Source
Biometrics and Bioinformatics, Vol 6, No 7 (2014), Pagination: 186-188Abstract
Gene selection is an important issue in microarray data processing. In this work, propose a capable method for selecting relevant genes. This work aim at finding the smallest set of genes that can ensure highly accurate classification of cancers from microarray data by using supervised machine learning algorithms. Initially utilized spectral biclustering to achieve the best two eigenvectors for class partition. Then gene combinations are chosen based on the similarity among the genes and the best eigenvectors. Proposed simple yet very effective method involves two steps. In the first step, choose some important genes using a feature importance ranking scheme. In the second step, test the classification capability of all simple combinations of those important genes by using a good classifier. This work demonstrates semi-unsupervised and T-Score gene selection method using two microarray cancer data sets, i.e., the lymphoma and leukemia data sets. Experimental result shows proposed method is able to identify a single gene which leads to predictions with very high accuracy.
Keywords
Gene Ranking, Semi-Unsupervised Gene Selection, Spectral Biclustering, Cancer Classification, T-Score.- Estimation of Energy Efficient Consumption of Reactive and Proactive Routing Protocols in MANET
Authors
1 Department of Computer Science, STC College, Pollachi, IN
Source
Networking and Communication Engineering, Vol 12, No 1 (2020), Pagination: 7-10Abstract
Certain unique combinations of characteristics make routing in ad hoc networks interesting. The limited energy capacity of mobile computing devices has brought energy conservation to the forefront of concerns for enabling mobile communications. This is a particular concern for mobile ad hoc networks where devices are expected to be deployed for long periods of time with limited potential for recharging batteries. Such expectations demand the conservation of energy in all components of the mobile device to support improvements in device lifetime. Mobile Ad hoc Networks consist of mobile nodes with limited battery power. The critical issue for routing in mobile ad hoc network is how to select a stable path with longer lifetime since mobility and power drain of a node causes frequent path failure. This path failure causes frequent route discovery which affects the performance of the routing protocol. The path failure also increases computational overhead of the nodes. Hence, in this paper, we introduce Energy Efficient – Optimized Hierarchical Routing Algorithm (EE-OHRA), to provide better and more stable energy based routing path for similar node’s characteristics in a network environment. The related node discovery algorithm is planned in that network, this is applied to select the routing node for the particular path with similar or related nodes with its capacity, and characteristics. It is easy to offer predictable packet transmission in a specific path. The theoretical analysis and simulation results shows that our proposed optimized EE-OHRA reduces total power consumption, reduces end-to-end delay, increases packet delivery ratio and achieves maximum network lifetime.